Improved NSGA-II for energy-efficient distributed no-wait flow-shop with sequence-dependent setup time
نویسندگان
چکیده
Abstract This paper addresses a multi-objective energy-efficient scheduling problem of the distributed permutation flowshop with sequence-dependent setup time and no-wait constraints (EEDNWFSP), which have important practical applications. Two objectives minimization both makespan total energy consumption (TEC) are considered simultaneously. To address this problem, new mixed-integer linear programming (MILP) model is formulated. Considering issues faced in solving large-scale instances, an improved non-dominated sorting genetic algorithm (INSGA-II) further proposed that uses two variants Nawaz-Enscore-Ham heuristic (NEH) to generate high-quality initial population. Moreover, problem-specific speed adjustment heuristics presented, can enhance qualities obtained solutions. In addition, four local global search operators designed improve exploration exploitation abilities algorithm. The effectiveness was verified using extensive computational tests comparisons. experimental results show INSGA-II more effective compared other efficient algorithms.
منابع مشابه
Solving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کاملsolving group scheduling problem in no-wait flow shop with sequence dependent setup times
different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. conventional productionmethods are constantly subs...
متن کاملA bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
متن کامل
Solving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2022
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-022-00830-6